Synthesizing iterators from abstraction functions
نویسندگان
چکیده
منابع مشابه
Synthesizing Ranking Functions from Bits and Pieces
In this work, we present a novel approach based on recent advances in software model checking to synthesize ranking functions and prove termination (and non-termination) of imperative programs. Our approach incrementally refines a termination argument from an under-approximation of the terminating program state. Specifically, we learn bits of information from terminating executions, and from th...
متن کاملFrom Functions to Object-Orientation by Abstraction
In previous work we developed a framework of computational models for function and object execution. The models on an higher level of abstraction in this framework allow for concurrent execution of functions and objects. We show that the computational model for object execution complies with the fundamentals of object-orientation. Ke ywords: programming, computational model, execution model, ma...
متن کاملGraph Iterators: Decoupling Graph Structures from Algorithms
I will present a way to implement graph algorithms which is different from traditional methods. This work was motivated by the belief that some ideas from software engineering should be applied to graph algorithms. Re-usability of software is an important and difficult problem in general, and this is particularly true for graph algorithms. The scientific literature demonstrates plenty of applic...
متن کاملOn Order Invariant Synthesizing Functions
We give a description of the class of continuous functions that are comparison meaningful in the sense of measurement theory. When idempotency is assumed, this class reduces to the Boolean max-min functions (lattice polynomials). In that case, continuity can be replaced by increasing monotonicity, provided that the domain of definition is open.
متن کاملIterators can be Independent “from” Their Collections
External iterators pose problems for alias control mechanisms: they have access to collection interals and yet are not accessible from the collection; they may be used in contexts that are unaware of the collection. And yet iterators can benefit from alias control because iterators may fail “unexpectedly” when their collections are modified. We explain a novel aliasing annotation “from” that in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2013
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2480361.2371407